Visual analysis of network centralities

نویسندگان

  • Tim Dwyer
  • Seok-Hee Hong
  • Dirk Koschützki
  • Falk Schreiber
  • Kai Xu
چکیده

Centrality analysis determines the importance of vertices in a network based on their connectivity within the network structure. It is a widely used technique to analyse network-structured data. A particularly important task is the comparison of different centrality measures within one network. We present three methods for the exploration and comparison of centrality measures within a network: 3D parallel coordinates, orbit-based comparison and hierarchy-based comparison. There is a common underlying idea to all three methods: for each centrality measure the graph is copied and drawn in a separate 2D plane with vertex position dependent on centrality. These planes are then stacked into the third dimension so that the different centrality measures may be easily compared. Only the details of how centrality is mapped to vertex position are different in each method. For 3D parallel coordinates vertices are placed on vertical lines; for orbit-based comparison vertices are placed on concentric circles and for hierarchy-based comparison vertices are placed on horizontal lines. The second and third solutions make it particularly easy to track changing vertex-centrality values in the context of the underlying network structure. The usability of these methods is demonstrated on biological and social networks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Vincent - Visualization of Network Centralities

The use of network centralities in the field of network analysis plays an important role when the relative importance of nodes within the network topology should be rated. A single network can easily be represented by the use of standard graph drawing algorithms, but not only the exploration of one centrality might be important: the comparison of two or more of them is often crucial for a bette...

متن کامل

Exponentially Twisted Sampling: a Unified Approach for Centrality Analysis in Attributed Networks

In our recent works, we developed a probabilistic framework for structural analysis in undirected networks and directed networks. The key idea of that framework is to sample a network by a symmetric and asymmetric bivariate distribution and then use that bivariate distribution to formerly defining various notions, including centrality, relative centrality, community, and modularity. The main ob...

متن کامل

Analyzing Multiple Network Centralities with ViNCent

The analysis of multivariate networks is an important task in various application domains, such as social network analysis or biochemistry. In this paper, we address the interactive visual analysis of the results of centrality computations in context of networks. An important analytical aspect is to examine nodes according to specific centrality values and to compare them. We present a tool tha...

متن کامل

CentiLib: comprehensive analysis and exploration of network centralities

UNLABELLED CentiLib is a library and plug-in for the comprehensive analysis and exploration of network centralities. It provides 17 different node centrality and four graph centrality measures in a user-friendly interface and supports the exploration of analysis results within the networks. Its architecture allows for easy adaption to Java-based network analysis, simulation and visualization to...

متن کامل

A measure of centrality based on the spectrum of the Laplacian

We introduce a family of new centralities, the k-spectral centralities. k-spectral centrality is a measurement of importance with respect to the deformation of the graph Laplacian associated with the graph. Due to this connection, k-spectral centralities have various interpretations in terms of spectrally determined information. We explore this centrality in the context of several examples. Whi...

متن کامل

Centralities Based Analysis of Complex Networks

Characterizing, describing, and extracting information from a network is by now one of the main goals of science, since the study of network currently draws the attention of several fields of research, as biology, economics, social science, computer science and so on. The main goal is to analyze networks in order to extract their emergent properties (Bhalla & Iyengar (1999)) and to understand f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006